A SYMBOLIC CALCULUS OF REGULAR EXPRESSIONS
نویسندگان
چکیده
منابع مشابه
From Sequential Extended Regular Expressions to NFA with Symbolic Labels
Practical property specification languages such as the IEEE standard PSL use at their core Sequential Extended Regular Expressions (SERE). In order to enable the reuse of traditional verification techniques, it is necessary to translate SEREs into automata. SERE are regular expressions built over alphabets resulting from the state variables of the design under analysis. Thus, a traditional appr...
متن کاملLet-Binding with Regular Expressions in Lambda Calculus
We often give proper names to variables in programs based on their types, usages, and means, and the regularity and there are several kinds of conventions for variable-naming in programming languages. For example, we use variables i, j, k or i1, i2, i3 for thevariables of integer type. In this paper, we propose let-binding mechanism by which you can declare multiple variables simultaneously usi...
متن کاملA Generalization of Regular Expressions
CF-expressions are defined which generalize the regular one. It is established that so called pseudo-coiterating CF-expressions characterize the regular sets. The results are used to develop some more characterizations of the regular sets: the pseudo-coiterating D-graphs and the pseudo-coiterating pushdown automata (PDAs). An algorithm is presented for deciding whether a device of three mention...
متن کاملDerivatives of Regular Expressions ∗
The paper proposes a characterization of the structure of derivatives, and proves several properties of derivatives. The above work can be used to solve an issue in using Berry and Sethi’s result, i. e., finding the unique representatives of derivatives. keywords: Regular expressions, derivatives, finite automata.
متن کاملRegexpcount, a Symbolic Package for Counting Problems on Regular Expressions and Words
In previous work [10], we considered algorithms related to the statistics of matches with words and regular expressions in texts generated by Bernoulli or Markov sources. In this work these algorithms are extended for two purposes: to determine the statistics of simultaneous counting of different motifs, and to compute the waiting time for the first match with a motif in a model which may be co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of informatics and cybernetics
سال: 1987
ISSN: 0286-522X
DOI: 10.5109/13383